On Study of Unbalanced Tree-Structured Vector Quantizer 非对称树结构矢量量化方法研究
Inspired by a cycle-decomposition technique, we design a linear time complexity algorithm with 2n-2 fault-tolerance capability through proposing a new tree decomposition technique and utilizing the properties of completely unbalanced spanning tree in hypercubes. 通过深入挖掘超立方体中完全非平衡生成树的性质,并引入杨小帆教授的圈分解的思想,我们设计了一个线性时间复杂度的算法。
Because the unbalanced degree is hard to define, in this dissertation the external path length was used to measure the average updating cost of a key tree. 密钥树的不平衡程度难以判定,本文利用外部通路长度(ExternalPathLength)来表示密钥树上的平均更新路径,从而更好地定义了密钥树的不平衡度。
Applying the completely unbalanced spanning tree embedded in hypercubes and its properties to our algorithms, we improve the efficiency of breadth-first search ( BFS). 利用超立方体中的完全非平衡生成树及其在超立方体中特殊的性质,我们提高了广度优先搜索算法的效率。